A Secure Modified ID-Based Undeniable Signature Scheme
نویسندگان
چکیده
Han et al. proposed the first identity-based undeniable signature scheme at the fourth ACM conference on electronic commerce. Zhang et al. showed two attacks (the denial attack and the forge attack) against the scheme. In this paper, we modify the scheme to make it secure against these attacks. We also show how to modify our scheme to make it be an ID-based convertible undeniable signature scheme.
منابع مشابه
Attack on Han et al.'s ID-based confirmer (undeniable) signature at ACM-EC'03
At the fourth ACM conference on electronic commerce (EC’03), S. Han, K.Y. Yeung and J. Wang proposed an ID-based confirmer signature scheme using pairings (actually, this is an ID-based undeniable signature scheme). However, in this paper, we will show that this signature scheme is not secure. The signer can deny any signature, even this signature is his valid signature and any one can forge a ...
متن کاملAn Attack on Libert et al.' s ID-based Undeniable Signature Scheme
In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this article, we show that the scheme is not secure. In particular, if a valid message-signature pair has been revealed, an adversary can forge the signer’s signature for any arbitrary message for which the signer has no way to deny it. More importantly, through this exa...
متن کاملIsogeny-Based Quantum-Resistant Undeniable Signatures
We propose an undeniable signature scheme based on elliptic curve isogenies, and prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. Our proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption.
متن کاملThreshold Undeniable RSA Signature Scheme
Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almost all the existed schemes are based on discrete logarithm cryptosystems. In this paper, based on an improvement of the practical threshold RSA signature scheme proposed by Shoup at Eurocrypt’2000 and the first undenia...
متن کاملA Threshold Undeniable Signature Scheme Without a Trusted Party
At Auscrpt’92, Harn and Yang first proposed the conception of (t, n) threshold undeniable signature, in which only subsets with at least t members can represent a group to generate, confirm or disavow a signature. Later, several schemes are proposed, but none of them is secure. So up to now, how to design a secure (t, n) threshold undeniable signature scheme is remained an open problem. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003